- problem of nodes
- фтт задача узлов
English-russian dictionary of physics. 2013.
problem of nodes
Смотреть что такое "problem of nodes" в других словарях:
Hidden node problem — In wireless networking, the hidden node problem occurs when a Node (networking) node is visible from a wireless access point (AP), but not from other nodes communicating with said AP. This leads to difficulties in media access control.… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… … Wikipedia
Missionaries and cannibals problem — The missionaries and cannibals problem, and the closely related jealous husbands problem, are classic river crossing problems.[1] The missionaries and cannibals problem is a well known toy problem in artificial intelligence, where it was used by… … Wikipedia
Constraint satisfaction dual problem — The dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only contain binary constraints, and are therefore solvable by algorithms tailored for such… … Wikipedia
Exposed terminal problem — In wireless networks, the exposed node problem occurs when a node is prevented from sending packets to other nodes due to a neighboring transmitter. Consider an example of 4 nodes labeled R1, S1, S2, and R2, where the two receivers are out of… … Wikipedia
Circulation problem — The circulation problem and its variants is a generalisation of network flow problems, with the added constraint of a lower bound on edge flows, and with flow conservation also being required for the source and sink (i.e. there are no special… … Wikipedia
Longest common substring problem — The longest common substring problem is to find the longest string (or strings) that is a substring (or are substrings) of two or more strings. It should not be confused with the longest common subsequence problem. (For an explanation of the… … Wikipedia
Two Generals' Problem — In computing, the Two Generals Problem is a thought experiment meant to illustrate the pitfalls and design challenges of attempting to coordinate an action by communicating over an unreliable link. It is related to the more general Byzantine… … Wikipedia
Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network … Wikipedia
Numerical sign problem — The numerical sign problem refers to the difficulty of numerically evaluating the integral of a highly oscillatory function of a large number of variables. Numerical methods fail because of the near cancellation of the positive and negative… … Wikipedia
